Weighted Logics for Nested Words and Algebraic Formal Power Series
نویسنده
چکیده
Nested words, a model for recursive programs proposed by Alur and Madhusudan, have recently gained much interest. In this paper we introduce quantitative extensions and study nested word series which assign to nested words elements of a semiring. We show that regular nested word series coincide with series definable in weighted logics as introduced by Droste and Gastin. For this we establish a connection between nested words and the free bisemigroup. Applying our result, we obtain characterizations of algebraic formal power series in terms of weighted logics. This generalizes results of Lautemann, Schwentick and Thérien on context-free languages.
منابع مشابه
HYPERTRANSCENDENTAL FORMAL POWER SERIES OVER FIELDS OF POSITIVE CHARACTERISTIC
Let $K$ be a field of characteristic$p>0$, $K[[x]]$, the ring of formal power series over $ K$,$K((x))$, the quotient field of $ K[[x]]$, and $ K(x)$ the fieldof rational functions over $K$. We shall give somecharacterizations of an algebraic function $fin K((x))$ over $K$.Let $L$ be a field of characteristic zero. The power series $finL[[x]]$ is called differentially algebraic, if it satisfies...
متن کاملWeighted Automata and Weighted Logics over Tree-like Structures
In theoretical computer science the connection between automata and logic is of fundamental importance. This connection was first considered by Büchi and Elgot in the 1960s, when they showed that the languages accepted by finite automata are precisely those languages that can be defined in monadic second-order logic (MSO). In this thesis we consider extensions of Büchi’s and Elgot’s theorem int...
متن کاملPebble Weighted Automata and Transitive Closure Logics
We introduce new classes of weighted automata on words. Equipped with pebbles and a two-way mechanism, they go beyond the class of recognizable formal power series, but capture a weighted version of first-order logic with bounded transitive closure. In contrast to previous work, this logic allows for unrestricted use of universal quantification. Our main result states that pebble weighted autom...
متن کاملWeighted Automata and Logics for Infinite Nested Words
Nested words introduced by Alur and Madhusudan are used to capture structures with both linear and hierarchical order, e.g. XML documents, without losing valuable closure properties. Furthermore, Alur and Madhusudan introduced automata and equivalent logics for both finite and infinite nested words, thus extending Büchi’s theorem to nested words. Recently, average and discounted computations of...
متن کاملWeighted automata and weighted logics on innite words
We introduce weighted automata over in nite words with Muller acceptance condition and we show that their behaviors coincide with the semantics of weighted restricted MSO-sentences. Furthermore, we establish an equivalence property of weighted Muller and weighted Büchi automata over certain semirings. Keywords: Weighted logics, Weighted Muller automata, In nitary formal power series, Weighted B...
متن کامل